Methods and apparatus of video coding using history-based motion vector prediction

ABSTRACT

A computing device performs a method of decoding video data by acquiring a video bitstream including data associated with multiple encoded pictures, each picture including multiple rows of coding tree units (CTUs) and each CTU including one or more coding units (CUs). A data buffer storing a plurality of history-based motion vector predictors is used for encoding the rows of CTUs and the decoding process resets the buffer before decoding a first CU of a current row of CTUs. For a current CU of the row of CTUs, a motion vector candidate list is constructed from exploiting spatial and temporal correlation of motion vectors of neighbouring code units as well as the history-based motion vector predictors in the buffer. Finally, one motion vector predictor is selected, from the motion vector candidate list, for decoding the current CU and the buffer is updated based on the selected one.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation application of U.S. patentapplication Ser. No. 18/075,309, filed on Dec. 5, 2022, which is acontinuation application of U.S. patent application Ser. No. 17/149,669,filed on Jan. 14, 2021, which is a continuation application ofInternational Application No. PCT/US2019/041923, filed on Jul. 16, 2019,which claims the benefit of U.S. Provisional Application No. 62/700,106,filed on Jul. 18, 2018, all of which are incorporated herein in theirentireties by reference.

TECHNICAL FIELD

The present application generally relates to video data encoding anddecoding, and in particular, to method and system of video coding usinghistory-based motion vector prediction.

BACKGROUND

Digital video is supported by a variety of electronic devices, such asdigital televisions, laptop or desktop computers, tablet computers,digital cameras, digital recording devices, digital media players, videogaming consoles, smart phones, video teleconferencing devices, videostreaming devices, etc. The electronic devices transmit, receive,encode, decode, and/or store digital video data by implementing videocompression/decompression standards as defined by MPEG-4, ITU-T H.263,ITU-T H.264/MPEG-4, Part 10, Advanced Video Coding (AVC), HighEfficiency Video Coding (HEVC), and Versatile Video Coding (VVC)standard. Video compression typically includes performing spatial (intraframe) prediction and/or temporal (inter frame) prediction to reduce orremove redundancy inherent in the video data. For block-based videocoding, a video frame is partitioned into one or more slices, each slicehaving multiple video blocks, which may also be referred to as codingtree units (CTUs). Each CTU may contain one coding unit (CU) orrecursively split into smaller CUs until the predefined minimum CU sizeis reached. Each CU (also named leaf CU) contains one or multipletransform units (TUs) and each CU also contains one or multipleprediction units (PUs). Each CU can be coded in either intra, inter orIBC modes. Video blocks in an intra coded (I) slice of a video frame areencoded using spatial prediction with respect to reference samples inneighbor blocks within the same video frame. Video blocks in an intercoded (P or B) slice of a video frame may use spatial prediction withrespect to reference samples in neighbor blocks within the same videoframe or temporal prediction with respect to reference samples in otherprevious and/or future reference video frames.

Spatial or temporal prediction based on a reference block that has beenpreviously encoded, e.g., a neighbor block, results in a predictiveblock for a current video block to be coded. The process of finding thereference block may be accomplished by block matching algorithm.Residual data representing pixel differences between the current blockto be coded and the predictive block is referred to as a residual blockor prediction errors. An inter-coded block is encoded according to amotion vector that points to a reference block in a reference frameforming the predictive block, and the residual block. The process ofdetermining the motion vector is typically referred to as motionestimation. An intra coded block is encoded according to an intraprediction mode and the residual block. For further compression, theresidual block is transformed from the pixel domain to a transformdomain, e.g., frequency domain, resulting in residual transformcoefficients, which may then be quantized. The quantized transformcoefficients, initially arranged in a two-dimensional array, may bescanned to produce a one-dimensional vector of transform coefficients,and then entropy encoded into a video bitstream to achieve even morecompression.

The encoded video bitstream is then saved in a computer-readable storagemedium (e.g., flash memory) to be accessed by another electronic devicewith digital video capability or directly transmitted to the electronicdevice wired or wirelessly. The electronic device then performs videodecompression (which is an opposite process to the video compressiondescribed above) by, e.g., parsing the encoded video bitstream to obtainsyntax elements from the bitstream and reconstructing the digital videodata to its original format from the encoded video bitstream based atleast in part on the syntax elements obtained from the bitstream, andrenders the reconstructed digital video data on a display of theelectronic device.

With digital video quality going from high definition, to 4K×2K or even8K×4K, the amount of vide data to be encoded/decoded growsexponentially. It is a constant challenge in terms of how the video datacan be encoded/decoded more efficiently while maintaining the imagequality of the decoded video data.

SUMMARY

The present application describes implementations related to video dataencoding and decoding and, more particularly, to system and method ofparallel processing of video data during video encoding and decodingusing history-based motion vector prediction.

According to a first aspect of the present application, a method ofdecoding video data is performed at a computing device having one ormore processors and memory storing a plurality of programs to beexecuted by the one or more processors. After acquiring a videobitstream, the computing device begins by extracting data associatedwith multiple encoded pictures from the video bitstream, each pictureincluding multiple rows of coding tree units (CTUs) and each CTUincluding one or more coding units (CUs). Before starting decoding afirst CU of a current row of CTUs of a current picture being decoded,the computing device resets a history-based motion vector predictor(HMVP) table. Then while decoding the current row of CTUs, the computingdevice maintains a plurality of motion vector predictors in the HMVPtable, each motion vector predictor having been used for decoding atleast one CU. For a current CU of the current row of CTUs to be decoded,the computing device extracts a prediction mode from the video bitstreamand constructs a motion vector candidate list in accordance with theprediction mode and based, at least in part, on the motion vectorpredictors in the HMVP table. After selecting, from the motion vectorcandidate list, a motion vector predictor, the computing devicedetermines a motion vector based, at least in part, on the predictionmode and the selected motion vector predictor, decodes the current CUusing the determined motion vector and updates the HMVP table based onthe determined motion vector.

According to a second aspect of the present application, a computingdevice includes one or more processors, memory and a plurality ofprograms stored in the memory. The programs, when executed by the one ormore processors, cause the computing device to perform operations asdescribed above.

According to a third aspect of the present application, a non-transitorycomputer readable storage medium stores a plurality of programs forexecution by a computing device having one or more processors. Theprograms, when executed by the one or more processors, cause thecomputing device to perform operations as described above.

BRIEF DESCRIPTION OF DRAWINGS

The accompanying drawings, which are included to provide a furtherunderstanding of the implementations and are incorporated herein andconstitute a part of the specification, illustrate the describedimplementations and together with the description serve to explain theunderlying principles. Like reference numerals refer to correspondingparts.

FIG. 1 is a block diagram illustrating an exemplary video encoding anddecoding system in accordance with some implementations of the presentdisclosure.

FIG. 2 is a block diagram illustrating an exemplary video encoder inaccordance with some implementations of the present disclosure.

FIG. 3 is a block diagram illustrating an exemplary video decoder inaccordance with some implementations of the present disclosure.

FIGS. 4A-4D are block diagrams illustrating how a frame is recursivelyquad-tree partitioned into multiple video blocks of different sizes inaccordance with some implementations of the present disclosure.

FIG. 5A is a block diagram illustrating spatially neighboring andtemporally collocated block positions of a current CU to be encoded inaccordance with some implementations of the present disclosure.

FIG. 5B is a block diagram illustrating multi-threaded encoding ofmultiple rows of CTUs of a picture using wavefront parallel processingin accordance with some implementations of the present disclosure.

FIG. 6 is a flowchart illustrating an exemplary process by which a videocoder implements the techniques of constructing a motion vectorpredictor candidate list in accordance with some implementations of thepresent disclosure.

DETAILED DESCRIPTION

Reference will now be made in detail to specific implementations,examples of which are illustrated in the accompanying drawings. In thefollowing detailed description, numerous non-limiting specific detailsare set forth in order to assist in understanding the subject matterpresented herein. But it will be apparent to one of ordinary skill inthe art that various alternatives may be used without departing from thescope of claims and the subject matter may be practiced without thesespecific details. For example, it will be apparent to one of ordinaryskill in the art that the subject matter presented herein can beimplemented on many types of electronic devices with digital videocapabilities.

FIG. 1 is a block diagram illustrating an exemplary system 10 forencoding and decoding video blocks in parallel in accordance with someimplementations of the present disclosure. As shown in FIG. 1 , system10 includes a source device 12 that generates and encodes video data tobe decoded at a later time by a destination device 14. Source device 12and destination device 14 may comprise any of a wide variety ofelectronic devices, including desktop or laptop computers, tabletcomputers, smart phones, set-top boxes, digital televisions, cameras,display devices, digital media players, video gaming consoles, videostreaming device, or the like. In some implementations, source device 12and destination device 14 are equipped with wireless communicationcapabilities.

In some implementations, destination device 14 may receive the encodedvideo data to be decoded via a link 16. Link 16 may comprise any type ofcommunication medium or device capable of moving the encoded video datafrom source device 12 to destination device 14. In one example, link 16may comprise a communication medium to enable source device 12 totransmit the encoded video data directly to destination device 14 inreal-time. The encoded video data may be modulated according to acommunication standard, such as a wireless communication protocol, andtransmitted to destination device 14. The communication medium maycomprise any wireless or wired communication medium, such as a radiofrequency (RF) spectrum or one or more physical transmission lines. Thecommunication medium may form part of a packet-based network, such as alocal area network, a wide-area network, or a global network such as theInternet. The communication medium may include routers, switches, basestations, or any other equipment that may be useful to facilitatecommunication from source device 12 to destination device 14.

In some other implementations, the encoded video data may be transmittedfrom output interface 22 to a storage device 32. Subsequently, theencoded video data in storage device 32 may be accessed by destinationdevice 14 via input interface 28. Storage device 32 may include any of avariety of distributed or locally accessed data storage media such as ahard drive, Blu-ray discs, DVDs, CD-ROMs, flash memory, volatile ornon-volatile memory, or any other suitable digital storage media forstoring encoded video data. In a further example, storage device 32 maycorrespond to a file server or another intermediate storage device thatmay hold the encoded video data generated by source device 12.Destination device 14 may access the stored video data from storagedevice 32 via streaming or downloading. The file server may be any typeof computer capable of storing encoded video data and transmitting theencoded video data to destination device 14. Exemplary file serversinclude a web server (e.g., for a website), an FTP server, networkattached storage (NAS) devices, or a local disk drive. Destinationdevice 14 may access the encoded video data through any standard dataconnection, including a wireless channel (e.g., a Wi-Fi connection), awired connection (e.g., DSL, cable modem, etc.), or a combination ofboth that is suitable for accessing encoded video data stored on a fileserver. The transmission of encoded video data from storage device 32may be a streaming transmission, a download transmission, or acombination of both.

As shown in FIG. 1 , source device 12 includes a video source 18, avideo encoder 20 and an output interface 22. Video source 18 may includea source such as a video capture device, e.g., a video camera, a videoarchive containing previously captured video, a video feed interface toreceive video from a video content provider, and/or a computer graphicssystem for generating computer graphics data as the source video, or acombination of such sources. As one example, if video source 18 is avideo camera of a security surveillance system, source device 12 anddestination device 14 may form camera phones or video phones. However,the implementations described in the present application may beapplicable to video coding in general, and may be applied to wirelessand/or wired applications.

The captured, pre-captured, or computer-generated video may be encodedby video encoder 20. The encoded video data may be transmitted directlyto destination device 14 via output interface 22 of source device 12.The encoded video data may also (or alternatively) be stored ontostorage device 32 for later access by destination device 14 or otherdevices, for decoding and/or playback. Output interface 22 may furtherinclude a modem and/or a transmitter.

Destination device 14 includes an input interface 28, a video decoder30, and a display device 34. Input interface 28 may include a receiverand/or a modem and receive the encoded video data over link 16. Theencoded video data communicated over link 16, or provided on storagedevice 32, may include a variety of syntax elements generated by videoencoder 20 for use by video decoder 30 in decoding the video data. Suchsyntax elements may be included within the encoded video datatransmitted on a communication medium, stored on a storage medium, orstored a file server.

In some implementations, destination device 14 may include a displaydevice 34, which can be an integrated display device and an externaldisplay device that is configured to communicate with destination device14. Display device 34 displays the decoded video data to a user, and maycomprise any of a variety of display devices such as a liquid crystaldisplay (LCD), a plasma display, an organic light emitting diode (OLED)display, or another type of display device.

Video encoder 20 and video decoder 30 may operate according toproprietary or industry standards, such as VVC, HEVC, MPEG-4, Part 10,Advanced Video Coding (AVC), or extensions of such standards. It shouldbe understood that the present application is not limited to a specificvideo coding/decoding standard and may be applicable to other videocoding/decoding standards. It is generally contemplated that videoencoder 20 of source device 12 may be configured to encode video dataaccording to any of these current or future standards. Similarly, it isalso generally contemplated that video decoder 30 of destination device14 may be configured to decode video data according to any of thesecurrent or future standards.

Video encoder 20 and video decoder 30 each may be implemented as any ofa variety of suitable encoder circuitry, such as one or moremicroprocessors, digital signal processors (DSPs), application specificintegrated circuits (ASICs), field programmable gate arrays (FPGAs),discrete logic, software, hardware, firmware or any combinations thereofWhen implemented partially in software, an electronic device may storeinstructions for the software in a suitable, non-transitorycomputer-readable medium and execute the instructions in hardware usingone or more processors to perform the video coding/decoding operationsdisclosed in the present disclosure. Each of video encoder 20 and videodecoder 30 may be included in one or more encoders or decoders, eitherof which may be integrated as part of a combined encoder/decoder (CODEC)in a respective device.

FIG. 2 is a block diagram illustrating an exemplary video encoder 20 inaccordance with some implementations described in the presentapplication. Video encoder 20 may perform intra and inter predictivecoding of video blocks within video frames. Intra predictive codingrelies on spatial prediction to reduce or remove spatial redundancy invideo data within a given video frame or picture. Inter predictivecoding relies on temporal prediction to reduce or remove temporalredundancy in video data within adjacent video frames or pictures of avideo sequence.

As shown in FIG. 2 , video encoder 20 includes video data memory 40,prediction processing unit 41, decoded picture buffer (DPB) 64, summer50, transform processing unit 52, quantization unit 54, and entropyencoding unit 56. Prediction processing unit 41 further includes motionestimation unit 42, motion compensation unit 44, partition unit 45,intra prediction processing unit 46, and intra block copy (BC) unit 48.In some implementations, video encoder 20 also includes inversequantization unit 58, inverse transform processing unit 60, and summer62 for video block reconstruction. A deblocking filter (not shown) maybe positioned between summer 62 and DPB 64 to filter block boundaries toremove blockiness artifacts from reconstructed video. An in loop filter(not shown) may also be used in addition to the deblocking filter tofilter the output of summer 62. Video encoder 20 may take the form of afixed or programmable hardware unit or may be divided among one or moreof the illustrated fixed or programmable hardware units.

Video data memory 40 may store video data to be encoded by thecomponents of video encoder 20. The video data in video data memory 40may be obtained, for example, from video source 18. DPB 64 is a bufferthat stores reference video data for use in encoding video data by videoencoder 20 (e.g., in intra or inter predictive coding modes). Video datamemory 40 and DPB 64 may be formed by any of a variety of memorydevices. In various examples, video data memory 40 may be on-chip withother components of video encoder 20, or off-chip relative to thosecomponents.

As shown in FIG. 2 , after receiving video data, partition unit 45within prediction processing unit 41 partitions the video data intovideo blocks. This partitioning may also include partitioning a videoframe into slices, tiles, or other larger coding units (CUs) accordingto a predefined splitting structures such as quad-tree structureassociated with the video data. The video frame may be divided intomultiple video blocks (or sets of video blocks referred to as tiles).Prediction processing unit 41 may select one of a plurality of possiblepredictive coding modes, such as one of a plurality of intra predictivecoding modes or one of a plurality of inter predictive coding modes, forthe current video block based on error results (e.g., coding rate andthe level of distortion). Prediction processing unit 41 may provide theresulting intra or inter prediction coded block to summer 50 to generatea residual block and to summer 62 to reconstruct the encoded block foruse as part of a reference frame subsequently. Prediction processingunit 41 also provides syntax elements, such as motion vectors,intra-mode indicators, partition information, and other such syntaxinformation, to entropy encoding unit 56.

In order to select an appropriate intra predictive coding mode for thecurrent video block, intra prediction processing unit 46 withinprediction processing unit 41 may perform intra predictive coding of thecurrent video block relative to one or more neighbor blocks in the sameframe as the current block to be coded to provide spatial prediction.Motion estimation unit 42 and motion compensation unit 44 withinprediction processing unit 41 perform inter predictive coding of thecurrent video block relative to one or more predictive blocks in one ormore reference frames to provide temporal prediction. Video encoder 20may perform multiple coding passes, e.g., to select an appropriatecoding mode for each block of video data.

In some implementations, motion estimation unit 42 determines the interprediction mode for a current video frame by generating a motion vector,which indicates the displacement of a prediction unit (PU) of a videoblock within the current video frame relative to a predictive blockwithin a reference video frame, according to a predetermined patternwithin a sequence of video frames. Motion estimation, performed bymotion estimation unit 42, is the process of generating motion vectors,which estimate motion for video blocks. A motion vector, for example,may indicate the displacement of a PU of a video block within a currentvideo frame or picture relative to a predictive block within a referenceframe (or other coded unit) relative to the current block being codedwithin the current frame (or other coded unit). The predeterminedpattern may designate video frames in the sequence as P frames or Bframes. Intra BC unit 48 may determine vectors, e.g., block vectors, forintra BC coding in a manner similar to the determination of motionvectors by motion estimation unit 42 for inter prediction, or mayutilize motion estimation unit 42 to determine the block vector.

A predictive block is a block of a reference frame that is deemed asclosely matching the PU of the video block to be coded in terms of pixeldifference, which may be determined by sum of absolute difference (SAD),sum of square difference (SSD), or other difference metrics. In someimplementations, video encoder 20 may calculate values for sub-integerpixel positions of reference frames stored in DPB 64. For example, videoencoder 20 may interpolate values of one-quarter pixel positions,one-eighth pixel positions, or other fractional pixel positions of thereference frame. Therefore, motion estimation unit 42 may perform amotion search relative to the full pixel positions and fractional pixelpositions and output a motion vector with fractional pixel precision.

Motion estimation unit 42 calculates a motion vector for a PU of a videoblock in an inter prediction coded frame by comparing the position ofthe PU to the position of a predictive block of a reference frameselected from a first reference frame list (List 0) or a secondreference frame list (List 1), each of which identifies one or morereference frames stored in DPB 64. Motion estimation unit 42 sends thecalculated motion vector to motion compensation unit 44 and then toentropy encoding unit 56.

Motion compensation, performed by motion compensation unit 44, mayinvolve fetching or generating the predictive block based on the motionvector determined by motion estimation unit 42. Upon receiving themotion vector for the PU of the current video block, motion compensationunit 44 may locate a predictive block to which the motion vector pointsin one of the reference frame lists, retrieve the predictive block fromDPB 64, and forward the predictive block to summer 50. Summer 50 thenforms a residual video block of pixel difference values by subtractingpixel values of the predictive block provided by motion compensationunit 44 from the pixel values of the current video block being coded.The pixel difference values forming the residual vide block may includeluma or chroma difference components or both. Motion compensation unit44 may also generate syntax elements associated with the video blocks ofa video frame for use by video decoder 30 in decoding the video blocksof the video frame. The syntax elements may include, for example, syntaxelements defining the motion vector used to identify the predictiveblock, any flags indicating the prediction mode, or any other syntaxinformation described herein. Note that motion estimation unit 42 andmotion compensation unit 44 may be highly integrated, but areillustrated separately for conceptual purposes.

In some implementations, intra BC unit 48 may generate vectors and fetchpredictive blocks in a manner similar to that described above inconnection with motion estimation unit 42 and motion compensation unit44, but with the predictive blocks being in the same frame as thecurrent block being coded and with the vectors being referred to asblock vectors as opposed to motion vectors. In particular, intra BC unit48 may determine an intra-prediction mode to use to encode a currentblock. In some examples, intra BC unit 48 may encode a current blockusing various intra-prediction modes, e.g., during separate encodingpasses, and test their performance through rate-distortion analysis.Next, intra BC unit 48 may select, among the various testedintra-prediction modes, an appropriate intra-prediction mode to use andgenerate an intra-mode indicator accordingly. For example, intra BC unit48 may calculate rate-distortion values using a rate-distortion analysisfor the various tested intra-prediction modes, and select theintra-prediction mode having the best rate-distortion characteristicsamong the tested modes as the appropriate intra-prediction mode to use.Rate-distortion analysis generally determines an amount of distortion(or error) between an encoded block and an original, unencoded blockthat was encoded to produce the encoded block, as well as a bitrate(i.e., a number of bits) used to produce the encoded block. Intra BCunit 48 may calculate ratios from the distortions and rates for thevarious encoded blocks to determine which intra-prediction mode exhibitsthe best rate-distortion value for the block.

In other examples, intra BC unit 48 may use motion estimation unit 42and motion compensation unit 44, in whole or in part, to perform suchfunctions for Intra BC prediction according to the implementationsdescribed herein. In either case, for Intra block copy, a predictiveblock may be a block that is deemed as closely matching the block to becoded, in terms of pixel difference, which may be determined by sum ofabsolute difference (SAD), sum of squared difference (SSD), or otherdifference metrics, and identification of the predictive block mayinclude calculation of values for sub-integer pixel positions.

Whether the predictive block is from the same frame according to intraprediction, or a different frame according to inter prediction, videoencoder 20 may form a residual video block by subtracting pixel valuesof the predictive block from the pixel values of the current video blockbeing coded, forming pixel difference values. The pixel differencevalues forming the residual video block may include both luma and chromacomponent differences.

Intra prediction processing unit 46 may intra-predict a current videoblock, as an alternative to the inter-prediction performed by motionestimation unit 42 and motion compensation unit 44, or the intra blockcopy prediction performed by intra BC unit 48, as described above. Inparticular, intra prediction processing unit 46 may determine an intraprediction mode to use to encode a current block. To do so, intraprediction processing unit 46 may encode a current block using variousintra prediction modes, e.g., during separate encoding passes, and intraprediction processing unit 46 (or a mode select unit, in some examples)may select an appropriate intra prediction mode to use from the testedintra prediction modes. Intra prediction processing unit 46 may provideinformation indicative of the selected intra-prediction mode for theblock to entropy encoding unit 56. Entropy encoding unit 56 may encodethe information indicating the selected intra-prediction mode in thebitstream.

After prediction processing unit 41 determines the predictive block forthe current video block via either inter prediction or intra prediction,summer 50 forms a residual video block by subtracting the predictiveblock from the current video block. The residual video data in theresidual block may be included in one or more transform units (TUs) andis provided to transform processing unit 52. Transform processing unit52 transforms the residual video data into residual transformcoefficients using a transform, such as a discrete cosine transform(DCT) or a conceptually similar transform.

Transform processing unit 52 may send the resulting transformcoefficients to quantization unit 54. Quantization unit 54 quantizes thetransform coefficients to further reduce bit rate. The quantizationprocess may also reduce the bit depth associated with some or all of thecoefficients. The degree of quantization may be modified by adjusting aquantization parameter. In some examples, quantization unit 54 may thenperform a scan of a matrix including the quantized transformcoefficients. Alternatively, entropy encoding unit 56 may perform thescan.

Following quantization, entropy encoding unit 56 entropy encodes thequantized transform coefficients into a video bitstream using, e.g.,context adaptive variable length coding (CAVLC), context adaptive binaryarithmetic coding (CABAC), syntax-based context-adaptive binaryarithmetic coding (SBAC), probability interval partitioning entropy(PIPE) coding or another entropy encoding methodology or technique. Theencoded bitstream may then be transmitted to video decoder 30, orarchived in storage device 32 for later transmission to or retrieval byvideo decoder 30. Entropy encoding unit 56 may also entropy encode themotion vectors and the other syntax elements for the current video framebeing coded.

Inverse quantization unit 58 and inverse transform processing unit 60apply inverse quantization and inverse transformation, respectively, toreconstruct the residual video block in the pixel domain for generatinga reference block for prediction of other video blocks. As noted above,motion compensation unit 44 may generate a motion compensated predictiveblock from one or more reference blocks of the frames stored in DPB 64.Motion compensation unit 44 may also apply one or more interpolationfilters to the predictive block to calculate sub-integer pixel valuesfor use in motion estimation.

Summer 62 adds the reconstructed residual block to the motioncompensated predictive block produced by motion compensation unit 44 toproduce a reference block for storage in DPB 64. The reference block maythen be used by intra BC unit 48, motion estimation unit 42 and motioncompensation unit 44 as a predictive block to inter predict anothervideo block in a subsequent video frame.

FIG. 3 is a block diagram illustrating an exemplary video decoder 30 inaccordance with some implementations of the present application. Videodecoder 30 includes video data memory 79, entropy decoding unit 80,prediction processing unit 81, inverse quantization unit 86, inversetransform processing unit 88, summer 90, and DPB 92. Predictionprocessing unit 81 further includes motion compensation unit 82, intraprediction processing unit 84, and intra BC unit 85. Video decoder 30may perform a decoding process generally reciprocal to the encodingprocess described above with respect to video encoder 20 in connectionwith FIG. 2 . For example, motion compensation unit 82 may generateprediction data based on motion vectors received from entropy decodingunit 80, while intra-prediction unit 84 may generate prediction databased on intra-prediction mode indicators received from entropy decodingunit 80.

In some examples, a unit of video decoder 30 may be tasked to performthe implementations of the present application. Also, in some examples,the implementations of the present disclosure may be divided among oneor more of the units of video decoder 30. For example, intra BC unit 85may perform the implementations of the present application, alone, or incombination with other units of video decoder 30, such as motioncompensation unit 82, intra prediction processing unit 84, and entropydecoding unit 80. In some examples, video decoder 30 may not includeintra BC unit 85 and the functionality of intra BC unit 85 may beperformed by other components of prediction processing unit 81, such asmotion compensation unit 82.

Video data memory 79 may store video data, such as an encoded videobitstream, to be decoded by the other components of video decoder 30.The video data stored in video data memory 79 may be obtained, forexample, from storage device 32, from a local video source, such as acamera, via wired or wireless network communication of video data, or byaccessing physical data storage media (e.g., a flash drive or harddisk). Video data memory 79 may include a coded picture buffer (CPB)that stores encoded video data from an encoded video bitstream. Decodedpicture buffer (DPB) 92 of video decoder 30 stores reference video datafor use in decoding video data by video decoder 30 (e.g., in intra orinter predictive coding modes). Video data memory 79 and DPB 92 may beformed by any of a variety of memory devices, such as dynamic randomaccess memory (DRAM), including synchronous DRAM (SDRAM),magneto-resistive RAM (MRAM), resistive RAM (RRAM), or other types ofmemory devices. For illustrative purpose, video data memory 79 and DPB92 are depicted as two distinct components of video decoder 30 in FIG. 3. But it will be apparent to one skilled in the art that video datamemory 79 and DPB 92 may be provided by the same memory device orseparate memory devices. In some examples, video data memory 79 may beon-chip with other components of video decoder 30, or off-chip relativeto those components.

During the decoding process, video decoder 30 receives an encoded videobitstream that represents video blocks of an encoded video frame andassociated syntax elements. Video decoder 30 may receive the syntaxelements at the video frame level and/or the video block level. Entropydecoding unit 80 of video decoder 30 entropy decodes the bitstream togenerate quantized coefficients, motion vectors or intra-prediction modeindicators, and other syntax elements. Entropy decoding unit 80 thenforwards the motion vectors and other syntax elements to predictionprocessing unit 81.

When the video frame is coded as an intra predictive coded (I) frame orfor intra coded predictive blocks in other types of frames, intraprediction processing unit 84 of prediction processing unit 81 maygenerate prediction data for a video block of the current video framebased on a signaled intra prediction mode and reference data frompreviously decoded blocks of the current frame.

When the video frame is coded as an inter-predictive coded (i.e., B orP) frame, motion compensation unit 82 of prediction processing unit 81produces one or more predictive blocks for a video block of the currentvideo frame based on the motion vectors and other syntax elementsreceived from entropy decoding unit 80. Each of the predictive blocksmay be produced from a reference frame within one of the reference framelists. Video decoder 30 may construct the reference frame lists, List 0and List 1, using default construction techniques based on referenceframes stored in DPB 92.

In some examples, when the video block is coded according to the intraBC mode described herein, intra BC unit 85 of prediction processing unit81 produces predictive blocks for the current video block based on blockvectors and other syntax elements received from entropy decoding unit80. The predictive blocks may be within a reconstructed region of thesame picture as the current video block defined by video encoder 20.

Motion compensation unit 82 and/or intra BC unit 85 determinesprediction information for a video block of the current video frame byparsing the motion vectors and other syntax elements, and then uses theprediction information to produce the predictive blocks for the currentvideo block being decoded. For example, motion compensation unit 82 usessome of the received syntax elements to determine a prediction mode(e.g., intra or inter prediction) used to code video blocks of the videoframe, an inter prediction frame type (e.g., B or P), constructioninformation for one or more of the reference frame lists for the frame,motion vectors for each inter predictive encoded video block of theframe, inter prediction status for each inter predictive coded videoblock of the frame, and other information to decode the video blocks inthe current video frame.

Similarly, intra BC unit 85 may use some of the received syntaxelements, e.g., a flag, to determine that the current video block waspredicted using the intra BC mode, construction information of whichvideo blocks of the frame are within the reconstructed region and shouldbe stored in DPB 92, block vectors for each intra BC predicted videoblock of the frame, intra BC prediction status for each intra BCpredicted video block of the frame, and other information to decode thevideo blocks in the current video frame.

Motion compensation unit 82 may also perform interpolation using theinterpolation filters as used by video encoder 20 during encoding of thevideo blocks to calculate interpolated values for sub-integer pixels ofreference blocks. In this case, motion compensation unit 82 maydetermine the interpolation filters used by video encoder 20 from thereceived syntax elements and use the interpolation filters to producepredictive blocks.

Inverse quantization unit 86 inverse quantizes the quantized transformcoefficients provided in the bitstream and entropy decoded by entropydecoding unit 80 using the same quantization parameter calculated byvideo encoder 20 for each video block in the video frame to determine adegree of quantization. Inverse transform processing unit 88 applies aninverse transform, e.g., an inverse DCT, an inverse integer transform,or a conceptually similar inverse transform process, to the transformcoefficients in order to reconstruct the residual blocks in the pixeldomain.

After motion compensation unit 82 or intra BC unit 85 generates thepredictive block for the current video block based on the vectors andother syntax elements, summer 90 reconstructs decoded video block forthe current video block by summing the residual block from inversetransform processing unit 88 and a corresponding predictive blockgenerated by motion compensation unit 82 and intra BC unit 85. Anin-loop filter (not pictured) may be positioned between summer 90 andDPB 92 to further process the decoded video block. The decoded videoblocks in a given frame are then stored in DPB 92, which storesreference frames used for subsequent motion compensation of next videoblocks. DPB 92, or a memory device separate from DPB 92, may also storedecoded video for later presentation on a display device, such asdisplay device 34 of FIG. 1 .

In a typical video coding process, a video sequence typically includesan ordered set of frames or pictures. Each frame may include threesample arrays, denoted SL, SCb, and SCr. SL is a two-dimensional arrayof luma samples. SCb is a two-dimensional array of Cb chroma samples.SCr is a two-dimensional array of Cr chroma samples. In other instances,a frame may be monochrome and therefore includes only onetwo-dimensional array of luma samples.

As shown in FIG. 4A, video encoder 20 (or more specifically partitionunit 45) generates an encoded representation of a frame by firstpartitioning the frame into a set of coding tree units (CTUs). A videoframe may include an integer number of CTUs ordered consecutively in araster scan order from left to right and from top to bottom. Each CTU isa largest logical coding unit and the width and height of the CTU aresignaled by the video encoder 20 in a sequence parameter set, such thatall the CTUs in a video sequence have the same size being one of128×128, 64×64, 32×32, and 16×16. But it should be noted that thepresent application is not necessarily limited to a particular size. Asshown in FIG. 4B, each CTU may comprise one coding tree block (CTB) ofluma samples, two corresponding coding tree blocks of chroma samples,and syntax elements used to code the samples of the coding tree blocks.The syntax elements describe properties of different types of units of acoded block of pixels and how the video sequence can be reconstructed atthe video decoder 30, including inter or intra prediction, intraprediction mode, motion vectors, and other parameters. In monochromepictures or pictures having three separate color planes, a CTU maycomprise a single coding tree block and syntax elements used to code thesamples of the coding tree block. A coding tree block may be an N×Nblock of samples.

To achieve a better performance, video encoder 20 may recursivelyperform tree partitioning such as binary-tree partitioning, quad-treepartitioning or a combination of both on the coding tree blocks of theCTU and divide the CTU into smaller coding units (CUs). As depicted inFIG. 4C, the 64×64 CTU 400 is first divided into four smaller CU, eachhaving a block size of 32×32. Among the four smaller CUs, CU 410 and CU420 are each divided into four CUs of 16×16 by block size. The two 16×16CUs 430 and 440 are each further divided into four CUs of 8×8 by blocksize. FIG. 4D depicts a quad-tree data structure illustrating the endresult of the partition process of the CTU 400 as depicted in FIG. 4C,each leaf node of the quad-tree corresponding to one CU of a respectivesize ranging from 32×32 to 8×8. Like the CTU depicted in FIG. 4B, eachCU may comprise a coding block (CB) of luma samples and twocorresponding coding blocks of chroma samples of a frame of the samesize, and syntax elements used to code the samples of the coding blocks.In monochrome pictures or pictures having three separate color planes, aCU may comprise a single coding block and syntax structures used to codethe samples of the coding block.

In some implementations, video encoder 20 may further partition a codingblock of a CU into one or more M×N prediction blocks (PB). A predictionblock is a rectangular (square or non-square) block of samples on whichthe same prediction, inter or intra, is applied. A prediction unit (PU)of a CU may comprise a prediction block of luma samples, twocorresponding prediction blocks of chroma samples, and syntax elementsused to predict the prediction blocks. In monochrome pictures orpictures having three separate color planes, a PU may comprise a singleprediction block and syntax structures used to predict the predictionblock. Video encoder 20 may generate predictive luma, Cb, and Cr blocksfor luma, Cb, and Cr prediction blocks of each PU of the CU.

Video encoder 20 may use intra prediction or inter prediction togenerate the predictive blocks for a PU. If video encoder 20 uses intraprediction to generate the predictive blocks of a PU, video encoder 20may generate the predictive blocks of the PU based on decoded samples ofthe frame associated with the PU. If video encoder 20 uses interprediction to generate the predictive blocks of a PU, video encoder 20may generate the predictive blocks of the PU based on decoded samples ofone or more frames other than the frame associated with the PU.

After video encoder 20 generates predictive luma, Cb, and Cr blocks forone or more PUs of a CU, video encoder 20 may generate a luma residualblock for the CU by subtracting the CU's predictive luma blocks from itsoriginal luma coding block such that each sample in the CU's lumaresidual block indicates a difference between a luma sample in one ofthe CU's predictive luma blocks and a corresponding sample in the CU'soriginal luma coding block. Similarly, video encoder 20 may generate aCb residual block and a Cr residual block for the CU, respectively, suchthat each sample in the CU's Cb residual block indicates a differencebetween a Cb sample in one of the CU's predictive Cb blocks and acorresponding sample in the CU's original Cb coding block and eachsample in the CU's Cr residual block may indicate a difference between aCr sample in one of the CU's predictive Cr blocks and a correspondingsample in the CU's original Cr coding block.

Furthermore, as illustrated in FIG. 4C, video encoder 20 may usequad-tree partitioning to decompose the luma, Cb, and Cr residual blocksof a CU into one or more luma, Cb, and Cr transform blocks. A transformblock is a rectangular (square or non-square) block of samples on whichthe same transform is applied. A transform unit (TU) of a CU maycomprise a transform block of luma samples, two corresponding transformblocks of chroma samples, and syntax elements used to transform thetransform block samples. Thus, each TU of a CU may be associated with aluma transform block, a Cb transform block, and a Cr transform block. Insome examples, the luma transform block associated with the TU may be asub-block of the CU's luma residual block. The Cb transform block may bea sub-block of the CU's Cb residual block. The Cr transform block may bea sub-block of the CU's Cr residual block. In monochrome pictures orpictures having three separate color planes, a TU may comprise a singletransform block and syntax structures used to transform the samples ofthe transform block.

Video encoder 20 may apply one or more transforms to a luma transformblock of a TU to generate a luma coefficient block for the TU. Acoefficient block may be a two-dimensional array of transformcoefficients. A transform coefficient may be a scalar quantity. Videoencoder 20 may apply one or more transforms to a Cb transform block of aTU to generate a Cb coefficient block for the TU. Video encoder 20 mayapply one or more transforms to a Cr transform block of a TU to generatea Cr coefficient block for the TU.

After generating a coefficient block (e.g., a luma coefficient block, aCb coefficient block or a Cr coefficient block), video encoder 20 mayquantize the coefficient block. Quantization generally refers to aprocess in which transform coefficients are quantized to possibly reducethe amount of data used to represent the transform coefficients,providing further compression. After video encoder 20 quantizes acoefficient block, video encoder 20 may entropy encode syntax elementsindicating the quantized transform coefficients. For example, videoencoder 20 may perform Context-Adaptive Binary Arithmetic Coding (CABAC)on the syntax elements indicating the quantized transform coefficients.Finally, video encoder 20 may output a bitstream that includes asequence of bits that forms a representation of coded frames andassociated data, which is either saved in storage device 32 ortransmitted to destination device 14.

After receiving a bitstream generated by video encoder 20, video decoder30 may parse the bitstream to obtain syntax elements from the bitstream.Video decoder 30 may reconstruct the frames of the video data based atleast in part on the syntax elements obtained from the bitstream. Theprocess of reconstructing the video data is generally reciprocal to theencoding process performed by video encoder 20. For example, videodecoder 30 may perform inverse transforms on the coefficient blocksassociated with TUs of a current CU to reconstruct residual blocksassociated with the TUs of the current CU. Video decoder 30 alsoreconstructs the coding blocks of the current CU by adding the samplesof the predictive blocks for PUs of the current CU to correspondingsamples of the transform blocks of the TUs of the current CU. Afterreconstructing the coding blocks for each CU of a frame, video decoder30 may reconstruct the frame.

As noted above, video coding achieves video compression using primarilytwo modes, i.e., intra-frame prediction (or intra-prediction) andinter-frame prediction (or inter-prediction). It is noted that IBC couldbe regarded as either intra-frame prediction or a third mode. Betweenthe two modes, inter-frame prediction contributes more to the codingefficiency than intra-frame prediction because of the use of motionvectors for predicting a current video block from a reference videoblock.

But with the ever improving video data capturing technology and morerefined video block size for preserving details in the video data, theamount of data required for representing motion vectors for a currentframe also increases substantially. One way of overcoming this challengeis to benefit from the fact that not only a group of neighboring CUs inboth the spatial and temporal domains have similar video data forpredicting purpose but the motion vectors between these neighboring CUsare also similar. Therefore, it is possible to use the motioninformation of spatially neighboring CUs and/or temporally collocatedCUs as an approximation of the motion information (e.g., motion vector)of a current CU by exploring their spatial and temporal correlation,which is also referred to as “motion vector predictor” (MVP) of thecurrent CU.

Instead of encoding, into the video bitstream, an actual motion vectorof the current CU determined by motion estimation unit 42 as describedabove in connection with FIG. 2 , the motion vector predictor of thecurrent CU is subtracted from the actual motion vector of the current CUto produce a motion vector difference (MVD) for the current CU. By doingso, there is no need to encode the motion vector determined by motionestimation unit 42 for each CU of a frame into the video bitstream andthe amount of data used for representing motion information in the videobitstream can be significantly decreased.

Like the process of choosing a predictive block in a reference frameduring inter-frame prediction of a code block, a set of rules need to beadopted by both video encoder 20 and video decoder 30 for constructing amotion vector candidate list for a current CU using those potentialcandidate motion vectors associated with spatially neighboring CUsand/or temporally collocated CUs of the current CU and then selectingone member from the motion vector candidate list as a motion vectorpredictor for the current CU. By doing so, there is no need to transmitthe motion vector candidate list itself between video encoder 20 andvideo decoder 30 and an index of the selected motion vector predictorwithin the motion vector candidate list is sufficient for video encoder20 and video decoder 30 to use the same motion vector predictor withinthe motion vector candidate list for encoding and decoding the currentCU.

In some implementations, each inter-prediction CU has three motionvector prediction modes including inter (which is also referred to as“advanced motion vector prediction” (AMVP)), skip, and merge forconstructing the motion vector candidate list. Under each mode, one ormore motion vector candidates may be added to the motion vectorcandidate list according to the algorithms described below. Ultimatelyone of them in the candidate list is used as the best motion vectorpredictor of the inter-prediction CU to be encoded into the videobitstream by video encoder 20 or decoded from the video bitstream byvideo decoder 30. To find the best motion vector predictor from thecandidate list, a motion vector competition (MVC) scheme is introducedto select a motion vector from a given candidate set of motion vectors,i.e., the motion vector candidate list, that includes spatial andtemporal motion vector candidates.

In addition to deriving motion vector predictor candidates fromspatially neighboring or temporally collocated CUs, the motion vectorpredictor candidates can also be derived from the so-called“history-based motion vector prediction” (HMVP) table. The HMVP tablehouses a predefined number of motion vector predictors, each having beenused for encoding/decoding a particular CU of the same row of CTUs (orsometimes the same CTU). Because of the spatial/temporal proximity ofthese CUs, there is a high likelihood that one of the motion vectorpredictors in the HMVP table may be reused for encoding/decodingdifferent CUs within the same row of CTUs. Therefore, it is possible toachieve a higher code efficiency by including the HMVP table in theprocess of constructing the motion vector candidate list.

In some implementations, the HMVP table has a fixed length (e.g., 5) andis managed in a quasi-First-In-First-Out (FIFO) manner. For example, amotion vector is reconstructed for a CU when decoding one inter-codedblock of the CU. The HMVP table is updated on-the-fly with thereconstructed motion vector because such motion vector could be themotion vector predictor of a subsequent CU. When updating the HMVPtable, there are two scenarios: (i) the reconstructed motion vector isdifferent from other existing motion vectors in the HMVP table or (ii)the reconstructed motion vector is the same as one of the existingmotion vectors in the HMVP table. For the first scenario, thereconstructed motion vector is added to the HMVP table as the newest oneif the HMVP table is not full. If the HMVP table is already full, theoldest motion vector in the HMVP table needs to be removed from the HMVPtable first before the reconstructed motion vector is added as thenewest one. In other words, the HMVP table in this case is similar to aFIFO buffer such that the motion information located at the head of theFIFO buffer and associated with another previously inter-coded block isshifted out of the buffer so that the reconstructed motion vector isappended to the tail of the FIFO buffer as the newest member in the HMVPtable. For the second scenario, the existing motion vector in the HMVPtable that is substantially identical to the reconstructed motion vectoris removed from the HMVP table before the reconstructed motion vector isadded to the HMVP table as the newest one. If the HMVP table is alsomaintained in the form of a FIFO buffer, the motion vector predictorsafter the identical motion vector in the HMVP table are shifted forwardby one element to occupy the space left by the removed motion vector andthe reconstructed motion vector is then appended to the tail of the FIFObuffer as the newest member in the HMVP table.

The motion vectors in the HMVP table could be added to the motion vectorcandidate lists under different prediction modes such as AMVP, merge,skip, etc. It has been found that the motion information of previouslyinter-coded blocks stored in the HMVP table even not adjacent to thecurrent block can be utilized for more efficient motion vectorprediction.

After one MVP candidate is selected within the given candidate set ofmotion vectors for a current CU, video encoder 20 may generate one ormore syntax elements for the corresponding MVP candidate and encode theminto the video bitstream such that video decoder 30 can retrieve the MVPcandidate from the video bitstream using the syntax elements. Dependingon the specific mode used for constructing the motion vectors candidateset, different modes (e.g., AMVP, merge, skip, etc.) have different setsof syntax elements. For the AMVP mode, the syntax elements include interprediction indicators (List 0, List 1, or bi-directional prediction),reference indices, motion vector candidate indices, motion vectorprediction residual signal, etc. For the skip mode and the merge mode,only merge indices are encoded into the bitstream because the current CUinherits the other syntax elements including the inter predictionindicators, reference indices, and motion vectors from a neighboring CUreferred by the coded merge index. In the case of a skip coded CU, themotion vector prediction residual signal is also omitted.

FIG. 5A is a block diagram illustrating spatially neighboring andtemporally collocated block positions of a current CU to beencoded/decoded in accordance with some implementations of the presentdisclosure. For a given mode, a motion vector prediction (MVP) candidatelist is constructed by first checking the availability of motion vectorsassociated with the spatially left and above neighboring blockpositions, and the availability of motion vectors associated withtemporally collocated block positions and then the motion vectors in theHMVP table. During the process of constructing the MVP candidate list,some redundant MVP candidates are removed from the candidate list and,if necessary, zero-valued motion vector is added to make the candidatelist to have a fixed length (note that different modes may havedifferent fixed lengths). After the construction of the MVP candidatelist, video encoder 20 can select the best motion vector predictor fromthe candidate list and encode the corresponding index indicating thechosen candidate into the video bitstream.

Using FIG. 5A as an example and assuming that the candidate list has afixed length of two, the motion vector predictor (MVP) candidate listfor the current CU may be constructed by performing the following stepsin order under the AMVP mode:

-   -   1) Selection of MVP candidates from spatially neighboring CUs        -   a) Derive up to one non-scaled MVP candidate from one of the            two left spatial neighbour CUs starting with A0 and ending            with A1;        -   b) If no non-scaled MVP candidate from left is available in            the previous step, derive up to one scaled MVP candidate            from one of the two left spatial neighbour CUs starting with            A0 and ending with A1;        -   c) Derive up to one non-scaled MVP candidate from one of the            three above spatial neighbour CUs starting with B0, then B1,            and ending with B2;        -   d) If neither A0 nor A1 is available or if they are coded in            intra modes, derive up to one scaled MVP candidate from one            of the three above spatial neighbour CUs starting with B0,            then B1, and ending with B2;    -   2) If two MVP candidates are found in the previous steps and        they are identical, remove one of the two candidates from the        MVP candidate list;    -   3) Selection of MVP candidates from temporally collocated CUs        -   a) If the MVP candidate list after the previous step does            not include two MVP candidates, derive up to one MVP            candidate from the temporal collocated CUs (e.g., TO)    -   4) Selection of MVP candidates from the HMVP table        -   a) If the MVP candidate list after the previous step does            not include two MVP candidates, derive up to two            history-based MVP from the HMVP table; and    -   5) If the MVP candidate list after the previous step does not        include two MVP candidates, add up to two zero-valued MVPs to        the MVP candidate list.

Since there are only two candidates in the AMVP-mode MVP candidate listconstructed above, an associated syntax element like a binary flag isencoded into the bitstream to indicate that which of the two MVPcandidates within the candidate list is used for decoding the currentCU.

In some implementations, the MVP candidate list for the current CU underthe skip or merge mode may be constructed by performing a similar set ofsteps in order like the ones above. It is noted that one special kind ofmerge candidate called “pair-wise merge candidate” is also included intothe MVP candidate list for the skip or merge mode. The pair-wise mergecandidate is generated by averaging the MVs of the two previouslyderived merge-mode motion vector candidates. The size of the merge MVPcandidate list (e.g., from 1 to 6) is signaled in a slice header of thecurrent CU. For each CU in the merge mode, an index of the best mergecandidate is encoded using truncated unary binarization (TU). The firstbin of the merge index is coded with context and bypass coding is usedfor other bins.

As mentioned above, the history-based MVPs can be added to either theAMVP-mode MVP candidate list or the merge MVP candidate list after thespatial MVP and temporal MVP. The motion information of a previouslyinter-coded CU is stored in the HMVP table and used as a MVP candidatefor the current CU. The HMVP table is maintained during theencoding/decoding process. Whenever there is a non-sub-block inter-codedCU, the associated motion vector information is added to the last entryof the HMVP table as a new candidate while the motion vector informationstored in the first entry of the HMVP table is removed from therein (ifthe HMVP table is already full and there is no identical duplicate ofthe associated motion vector information in the table). Alternatively,the identical duplicate of the associated motion vector information isremoved from the table before the associated motion vector informationis added to the last entry of the HMVP table.

As noted above, intra block copy (IBC) can significantly improve thecoding efficiency of screen content materials. Since IBC mode isimplemented as a block-level coding mode, block matching (BM) isperformed at video encoder 20 to find an optimal block vector for eachCU. Here, a block vector is used to indicate the displacement from thecurrent block to a reference block, which has already been reconstructedwithin the current picture. An IBC-coded CU is treated as the thirdprediction mode other than the intra or inter prediction modes.

At the CU level, the IBC mode can be signaled as IBC AMVP mode or IBCskip/merge mode as follows:

-   -   IBC AMVP mode: a block vector difference (BVD) between the        actual block vector of a CU and a block vector predictor of the        CU selected from block vector candidates of the CU is encoded in        the same way as a motion vector difference is encoded under the        AMVP mode described above. The block vector prediction method        uses two block vector candidates as predictors, one from left        neighbor and the other one from above neighbor (if IBC coded).        When either neighbor is not available, a default block vector        will be used as a block vector predictor. A binary flag is        signaled to indicate the block vector predictor index. The IBC        AMVP candidate list consists of spatial and HMVP candidates.    -   IBC skip/merge mode: a merge candidate index is used to indicate        which of the block vector candidates in the merge candidate list        from neighboring IBC coded blocks is used to predict the block        vector for the current block. The IBC merge candidate list        consists of spatial, HMVP, and pairwise candidates.

Another approach of improving the coding efficiency adopted by thestate-of-art coding standard is to introduce the parallel processing tothe video encoding/decoding process using, e.g., a multi-core processor.For example, wavefront parallel processing (WPP) has already beenintroduced into HEVC as a feature of encoding or decoding of multiplerows CTUs in parallel using multiple threads.

FIG. 5B is a block diagram illustrating multi-threaded encoding ofmultiple rows of CTUs of a picture using wavefront parallel processing(WPP) in accordance with some implementations of the present disclosure.When WPP is enabled, it is possible to process multiple rows of CTUs inparallel in a wavefront fashion, where there may be a delay of two CTUsbetween the start of two neighboring wavefronts. For example, to codethe picture 500 using WPP, a video coder, such as video encoder 20 andvideo decoder 30, may divide the coding tree units (CTUs) of the picture500 into a plurality of wavefronts, each wavefront corresponding to arespective row of CTUs in the picture. The video coder may start codinga top wavefront, e.g., using a first coder core or thread. After thevideo coder has coded two or more CTUs of the top wavefront, the videocoder may start coding a second-to-top wavefront in parallel with codingthe top wavefront, e.g., using a second, parallel coder core or thread.After the video coder has coded two or more CTUs of the second-to-topwavefront, the video coder may start coding a third-to-top wavefront inparallel with coding the higher wavefronts, e.g., using a third,parallel coder core or thread. This pattern may continue down thewavefronts in the picture 500. In the present disclosure, a set of CTUsthat a video coder is concurrently coding, using WPP, is referred to asa “CTU group.” Thus, when the video coder uses WPP to code a picture,each CTU of the CTU group may belong to a unique wavefront of thepicture and the CTU may be offset from a CTU in a respective, abovewavefront by at least two columns of CTUs of the picture.

The video coder may initialize a context for a current wavefront forperforming context adaptive binary arithmetic coding (CABAC) of thecurrent wavefront based on data of the first two blocks of the abovewavefront, as well as one or more elements of a slice header for a sliceincluding the first code block of the current wavefront. The video codermay perform CABAC initialization of a subsequent wavefront (or CTU row)using the context states after coding two CTUs of a CTU row above thesubsequent CTU row. In other words, before beginning coding of a currentwavefront, a video coder (or more specifically, a thread of the videocoder) may code at least two blocks of a wavefront above the currentwavefront, assuming the current wavefront is not the top row of CTUs ofa picture. The video coder may then initialize a CABAC context for thecurrent wavefront after coding at least two blocks of a wavefront abovethe current wavefront. In this example, each CTU row of the picture 500is a separated partition and has an associated thread (WPP Thread 1, WPPThread 2, . . . ) such that the number of CTU rows in the picture 500can be encoded in parallel.

Because the current implementation of the HMVP table uses a globalmotion vector (MV) buffer to store previously reconstructed motionvectors, this HMVP table cannot be implemented on the WPP-enabledparallel encoding scheme described above in connection with FIG. 5B. Inparticular, the fact that the global MV buffer is shared by all thethreads of the encoding/decoding process of a video coder prevents theWPP threads after the first WPP thread (i.e., WPP Thread 1) from beingstarted since these WPP threads have to wait for the HMVP table updatefrom the last CTU (i.e., rightmost CTU) of the first WPP thread (i.e.,the first CTU row) to be completed.

To overcome the problem, it is proposed that the global MV buffer sharedby the WPP threads be replaced with multiple CTU row-dedicated bufferssuch that each wavefront of CTU row has its own buffer for storing anHMVP table corresponding to the CTU row being processed by acorresponding WPP thread when WPP is enabled at the video coder. It isnoted that each CTU row having its own HMVP table is equivalent toresetting the HMVP table before coding a first CU of the CTU row. TheHMVP table reset is to flush out all the motion vectors in the HMVPtable resulting from coding of another CTU row. In one implementation,the reset operation is to set the size of the available motion vectorpredictors in the HMVP table to be zero. In yet another implementation,the reset operations could be to set the reference index of all theentries in the HMVP table to be an invalid value such as −1. By doingso, the construction of MVP candidate list for a current CTU within aparticular wavefront, regardless of which one of the three modes, AMVP,merge, and skip, is dependent upon an HMVP table associated with a WPPthread processing the particular wavefront. There is no inter-dependencybetween different wavefronts other than the two-CTU delay describedabove and the construction of motion vector candidate lists associatedwith different wavefronts can proceed in parallel like the WPP processdepicted in FIG. 5B. In other words, at the beginning of processing aparticular wavefront, the HMVP table is reset to be empty withoutaffecting the coding of another wavefront of CTUs by another WPP thread.In some cases, the HMVP table can be reset to be empty before the codingof each individual CTU. In this case, the motion vectors in the HMVPtable are limited to a particular CTU and there is probably a higherchance of a motion vector within the HMVP table being selected as amotion vector of a current CU within the particular CTU.

FIG. 6 is a flowchart illustrating an exemplary process by which a videocoder such as video encoder 20 or video decoder 30 implements thetechniques of constructing a motion vector predictor candidate listusing at least the HMVP table in accordance with some implementations ofthe present disclosure. For illustrative purpose, the flowchart depictsa video decoding process. First, video decoder 30 acquires (610) anencoded video bitstream including data associated with multiple encodedpictures. As depicted in FIGS. 4A and 4C, each picture includes multiplerows of coding tree units (CTUs) and each CTU includes one or morecoding units (CUs). Video decoder 30 extracts different pieces ofinformation from the video bitstream, such as syntax elements and pixelvalues, to reconstruct the picture row by row.

Before decoding a current row of CTUs, video decoder 30 first resets(620) a history-based motion vector predictor (HMVP) table for thecurrent row of CTU. As noted above, the reset of the HMVP table ensuresthat video decoder 30 is capable of decoding multiple CTU rows of thecurrent picture in parallel using, e.g., a multi-threaded process, onethread having its own HMVP table per CTU row or a multi-core processor,one core having its own HMVP table per CTU row or both. In yet someother embodiments, before decoding a current CTU, video decoder 30 firstresets (620) a history-based motion vector predictor (HMVP) table forthe current CTU. As noted above, the reset of the HMVP table ensuresthat video decoder 30 is capable of decoding multiple CTUs of thecurrent picture in parallel using, e.g., a multi-threaded process, onethread having its own HMVP table per CTU or a multi-core processor, onecore having its own HMVP table per CTU or both.

While decoding the current row of CTUs (630), video decoder 30 maintains(630-1) a plurality of motion vector predictors in the HMVP table. Asnoted above, each motion vector predictor stored in the HMVP table hasbeen used for decoding at least another CU within the current row ofCTUs. The fact that the motion vector predictor is present in the HMVPtable is because it might be used again for predicting another CU withinthe current row of CTUs when the HMVP table participates the process ofconstructing the motion vector candidate list as described above.

For a current CU of the current row of CTUs, video decoder 30 firstextracts (630-3) a prediction mode from the video bitstream. As notedabove, a CU may have multiple types of prediction modes, includingadvanced motion vector prediction (AMVP) mode, a merge mode, a skipmode, an IBC AMVP mode and an IBC merge mode. Once video encoder 20chooses an appropriate prediction mode for the CU, the chosen predictionmode is signaled in the bitstream. As noted above, there are differentsets of steps executed in different orders for constructing a motionvector candidate list. Here video decoder 30 constructs (630-5) themotion vector candidate list in accordance with the prediction mode andbased, at least in part, on the plurality of motion vector predictors inthe HMVP table. Other sources from which the motion vector candidatelist include motion vector predictors from spatially neighboring CUsand/or temporally collocated CUs of the current CU (when the predictionmode is one of the AMVP mode, the IBC AMVP mode, and the IBC merge mode)and optionally pair-wise motion vector predictors (when the predictionmode is one of the merge mode and the skip mode). Optionally, when themotion vector candidate list does not reach a predefined length, one ormore zero-valued motion vector predictors may be added to the motionvector candidate list.

Next, video decoder 30 selects (630-7), from the motion vector candidatelist, a motion vector predictor for the current CU and determines(630-9) a motion vector based, at least in part, on the prediction modeand the selected motion vector predictor. As noted above, depending onwhether the prediction mode is AMVP mode or not, the selected motionvector predictor may or may not be the estimated motion vector for thecurrent CU. For example, if the prediction mode is the AMVP mode, theestimated motion vector is determined by adding a motion vectordifference recovered from the bitstream to the selected motion vectorpredictor and the current CU is then decoded using, at least partially,the estimated motion vector and a corresponding CU within a referencepicture. But if the prediction mode is the merge or skip mode, theselected motion vector predictor is already the estimated motion vector,which can be used for decoding the current CU along with thecorresponding CU within the reference picture. Finally, video decoder 30updates (630-11) the HMVP table based on the determined motion vector.As noted above, every member in the HMVP table has been used fordecoding at least another CU before and is kept in the HMVP table forconstructing the motion vector candidate list until it is removed fromthe HMVP table either by a table reset or by the insertion of a motionvector used for decoding another subsequent CU within the current row ofCTUs.

In some implementations, the insertion of a motion vector into the HMVPtable has two possible scenarios based on a comparison result betweenthe motion vector determined for the current CU and the plurality ofmotion vector predictors in the HMVP table. If none of the plurality ofplurality of motion vector predictors in the HMVP table is identical tothe determined motion vector, an earliest or oldest motion vectorpredictor is removed from the HMVP table when the HMVP table is full andthe motion vector is added to the table as a newest one. If one of theplurality of motion vector predictors in the HMVP table is identical tothe motion vector, the one identical motion vector predictor is thenremoved from the HMVP table and all the other motion vector predictorsafter the removed motion vector predictor are moved forward in the HMVPtable such that the motion vector is appended to the end of the HMVPtable as the newest one.

As noted above, two or more of the multiple rows of CTUs may beencoded/decoded in parallel, e.g., using WPP, each row of CTUs having anassociated HMVP table for storing a plurality of history-based motionvector predictors used for encoding/decoding the corresponding row ofCTUs. For example, a thread is assigned to the decoding of a particularrow of CTUs of the current picture being decoded such that differentrows of CTUs have different associated threads and can be decoded inparallel as described above in connection with FIG. 5B. In someexamples, video decoder 30 identifies one or more motion vectorpredictors within the motion vector candidate list as being redundantones and removes them from the motion vector candidate list to furtherimprove the coding efficiency.

In one or more examples, the functions described may be implemented inhardware, software, firmware, or any combination thereof. If implementedin software, the functions may be stored on or transmitted over, as oneor more instructions or code, a computer-readable medium and executed bya hardware-based processing unit. Computer-readable media may includecomputer-readable storage media, which corresponds to a tangible mediumsuch as data storage media, or communication media including any mediumthat facilitates transfer of a computer program from one place toanother, e.g., according to a communication protocol. In this manner,computer-readable media generally may correspond to (1) tangiblecomputer-readable storage media which is non-transitory or (2) acommunication medium such as a signal or carrier wave. Data storagemedia may be any available media that can be accessed by one or morecomputers or one or more processors to retrieve instructions, codeand/or data structures for implementation of the implementationsdescribed in the present application. A computer program product mayinclude a computer-readable medium.

The terminology used in the description of the implementations herein isfor the purpose of describing particular implementations only and is notintended to limit the scope of claims. As used in the description of theimplementations and the appended claims, the singular forms “a,” “an,”and “the” are intended to include the plural forms as well, unless thecontext clearly indicates otherwise. It will also be understood that theterm “and/or” as used herein refers to and encompasses any and allpossible combinations of one or more of the associated listed items. Itwill be further understood that the terms “comprises” and/or“comprising,” when used in this specification, specify the presence ofstated features, elements, and/or components, but do not preclude thepresence or addition of one or more other features, elements,components, and/or groups thereof.

It will also be understood that, although the terms first, second, etc.may be used herein to describe various elements, these elements shouldnot be limited by these terms. These terms are only used to distinguishone element from another. For example, a first electrode could be termeda second electrode, and, similarly, a second electrode could be termed afirst electrode, without departing from the scope of theimplementations. The first electrode and the second electrode are bothelectrodes, but they are not the same electrode.

The description of the present application has been presented forpurposes of illustration and description, and is not intended to beexhaustive or limited to the invention in the form disclosed. Manymodifications, variations, and alternative implementations will beapparent to those of ordinary skill in the art having the benefit of theteachings presented in the foregoing descriptions and the associateddrawings. The embodiment was chosen and described in order to bestexplain the principles of the invention, the practical application, andto enable others skilled in the art to understand the invention forvarious implementations and to best utilize the underlying principlesand various implementations with various modifications as are suited tothe particular use contemplated. Therefore, it is to be understood thatthe scope of claims is not to be limited to the specific examples of theimplementations disclosed and that modifications and otherimplementations are intended to be included within the scope of theappended claims.

What is claimed is:
 1. A decoding method, comprising: resetting ahistory-based motion vector predictor (HMVP) table before decoding afirst CU of a current row of CTUs of a current picture being decoded;decoding the current row of CTUs, comprising: maintaining a plurality ofmotion vector predictors in the HMVP table, each motion vector predictorin the HMVP table being used for decoding at least one CU of the currentrow of CTUs; for a current CU of the current row of CTUs to be decoded:constructing a motion vector candidate list in accordance with aprediction mode and based, at least in part, on the plurality of motionvector predictors in the HMVP table; selecting, from the motion vectorcandidate list, a motion vector predictor; determining a motion vectorbased, at least in part, on the prediction mode and the selected motionvector predictor for decoding the current CU; and updating the HMVPtable based on the determined motion vector, wherein the updating theHMVP table based on the determined motion vector includes: comparing theplurality of motion vector predictors in the HMVP table with thedetermined motion vector; in accordance with a comparison result thatone of the plurality of motion vector predictors in the HMVP table isidentical to the determined motion vector: removing the one identicalmotion vector predictor from the HMVP table; moving each of the motionvector predictors after the removed motion vector predictor forward inthe HMVP table; and adding the determined motion vector as a newest oneto the HMVP table, and wherein the prediction mode is an inter mode, themotion vector candidate list has a fixed length of two, and theconstructing the motion vector candidate list comprises: in a case wherehistory-based motion vector predictors from the HMVP table are selectedto construct the motion vector candidate list, adding up to twohistory-based motion vector predictors from the HMVP table to the motionvector candidate list.
 2. The method of claim 1, wherein the updatingthe HMVP table based on the determined motion vector further comprises:in accordance with a determination that none of the plurality ofplurality of motion vector predictors in the HMVP table is identical tothe determined motion vector: removing an earliest motion vectorpredictor from the HMVP table when the HMVP table is full; and addingthe determined motion vector as a newest one to the HMVP table.
 3. Themethod of claim 1, wherein the constructing the motion vector candidatelist further comprises: adding zero or more motion vector predictorsfrom spatially neighboring CUs and/or temporally collocated CUs of thecurrent CU to the motion vector candidate list; and when a currentlength of the motion vector candidate list is less than a firstpredefined threshold, adding zero or more history-based motion vectorpredictors from the HMVP table to the motion vector candidate list untilthe current length of the motion vector candidate list is equal to thefirst predefined threshold.
 4. The method of claim 3, wherein theconstructing the motion vector candidate list further comprises: whenthe current length of the motion vector candidate list is less than thefirst predefined threshold, adding zero or more zero-valued motionvector predictors to the motion vector candidate list until the currentlength of the motion vector candidate list is equal to the firstpredefined threshold.
 5. The method of claim 3, wherein the adding zeroor more motion vector predictors from spatially neighboring CUs and/ortemporally collocated CUs of the current CU to the motion vectorcandidate list comprises: adding zero or more motion vector predictorsfrom the spatially neighboring CUs of the current CU to the motionvector candidate list; and when the current length of the motion vectorcandidate list is less than the first predefined threshold, adding zeroor more motion vector predictors from the temporally collocated CUs ofthe current CU to the motion vector candidate list.
 6. The method ofclaim 5, wherein the adding zero or more motion vector predictors fromthe temporally collocated CUs of the current CU to the motion vectorcandidate list comprises: deriving up to one motion vector predictorcandidate from the temporally collocated CUs.
 7. The method of claim 1,wherein the resetting the HMVP table comprises: setting a size ofavailable motion vector predictors in the HMVP table to be zero.
 8. Themethod of claim 1, wherein the current picture being decoded is from avideo bitstream, and the decoding the current row of CTUs furthercomprises: extracting the prediction mode from the video bitstream.
 9. Acomputing device comprising: one or more processors; memory coupled tothe one or more processors; and a plurality of programs stored in thememory that, when executed by the one or more processors, cause thecomputing device to receive a video bitstream to perform operationsincluding: resetting a history-based motion vector predictor (HMVP)table before decoding a first CU of a current row of CTUs of a currentpicture being decoded; decoding the current row of CTUs, comprising:maintaining a plurality of motion vector predictors in the HMVP table,each motion vector predictor in the HMVP table being used for decodingat least one CU of the current row of CTUs; for a current CU of thecurrent row of CTUs to be decoded: constructing a motion vectorcandidate list in accordance with a prediction mode and based, at leastin part, on the plurality of motion vector predictors in the HMVP table;selecting, from the motion vector candidate list, a motion vectorpredictor; determining a motion vector based, at least in part, on theprediction mode and the selected motion vector predictor for decodingthe current CU; and updating the HMVP table based on the determinedmotion vector, wherein the updating includes: comparing the plurality ofmotion vector predictors in the HMVP table with the determined motionvector; in accordance with a comparison result that one of the pluralityof motion vector predictors in the HMVP table is identical to thedetermined motion vector: removing the one identical motion vectorpredictor from the HMVP table; moving each of the motion vectorpredictors after the removed motion vector predictor forward in the HMVPtable; and adding the determined motion vector as a newest one to theHMVP table, and wherein the prediction mode is an inter mode, the motionvector candidate list has a fixed length of two, and the constructingthe motion vector candidate list comprises: in a case wherehistory-based motion vector predictors from the HMVP table are selectedto construct the motion vector candidate list, adding up to twohistory-based motion vector predictors from the HMVP table to the motionvector candidate list.
 10. The computing device of claim 9, wherein theupdating the HMVP table based on the determined motion vector furthercomprises: in accordance with a determination that none of the pluralityof plurality of motion vector predictors in the HMVP table is identicalto the determined motion vector: removing an earliest motion vectorpredictor from the HMVP table when the HMVP table is full; and addingthe determined motion vector as a newest one to the HMVP table.
 11. Thecomputing device of claim 9, wherein the constructing the motion vectorcandidate list further comprises: adding zero or more motion vectorpredictors from spatially neighboring CUs and/or temporally collocatedCUs of the current CU to the motion vector candidate list; and when acurrent length of the motion vector candidate list is less than a firstpredefined threshold, adding zero or more history-based motion vectorpredictors from the HMVP table to the motion vector candidate list untilthe current length of the motion vector candidate list is equal to thefirst predefined threshold.
 12. The computing device of claim 11,wherein the constructing the motion vector candidate list furthercomprises: when the current length of the motion vector candidate listis less than the first predefined threshold, adding zero or morezero-valued motion vector predictors to the motion vector candidate listuntil the current length of the motion vector candidate list is equal tothe first predefined threshold.
 13. The computing device of claim 11,wherein the adding zero or more motion vector predictors from spatiallyneighboring CUs and/or temporally collocated CUs of the current CU tothe motion vector candidate list comprises: adding zero or more motionvector predictors from the spatially neighboring CUs of the current CUto the motion vector candidate list; and when the current length of themotion vector candidate list is less than the first predefinedthreshold, adding zero or more motion vector predictors from thetemporally collocated CUs of the current CU to the motion vectorcandidate list.
 14. The computing device of claim 13, wherein the addingzero or more motion vector predictors from the temporally collocated CUsof the current CU to the motion vector candidate list comprises:deriving up to one motion vector predictor candidate from the temporallycollocated CUs.
 15. The computing device of claim 9, wherein theresetting the HMVP table comprises: setting a size of available motionvector predictors in the HMVP table to be zero.
 16. A non-transitorycomputer readable storage medium storing a plurality of programs forexecution by a computing device having one or more processors, whereinthe plurality of programs, when executed by the one or more processors,cause the computing device to perform operations to process a videobitstream and store the processed video bitstream in the non-transitorycomputer readable storage medium, the operations including: resetting ahistory-based motion vector predictor (HMVP) table before decoding afirst CU of a current row of CTUs of a current picture being decoded;decoding the current row of CTUs, comprising: maintaining a plurality ofmotion vector predictors in the HMVP table, each motion vector predictorin the HMVP table being used for decoding at least one CU of the currentrow of CTUs; for a current CU of the current row of CTUs to be decoded:constructing a motion vector candidate list in accordance with aprediction mode and based, at least in part, on the plurality of motionvector predictors in the HMVP table; selecting, from the motion vectorcandidate list, a motion vector predictor; determining a motion vectorbased, at least in part, on the prediction mode and the selected motionvector predictor for decoding the current CU; and updating the HMVPtable based on the determined motion vector, wherein the updating theHMVP table based on the determined motion vector includes: comparing theplurality of motion vector predictors in the HMVP table with thedetermined motion vector; in accordance with a comparison result thatone of the plurality of motion vector predictors in the HMVP table isidentical to the determined motion vector: removing the one identicalmotion vector predictor from the HMVP table; moving each of the motionvector predictors after the removed motion vector predictor forward inthe HMVP table; and adding the determined motion vector as a newest oneto the HMVP table, and wherein the prediction mode is an inter mode, themotion vector candidate list has a fixed length of two, and theconstructing the motion vector candidate list comprises: in a case wherehistory-based motion vector predictors from the HMVP table are selectedto construct the motion vector candidate list, adding up to twohistory-based motion vector predictors from the HMVP table to the motionvector candidate list.
 17. The non-transitory computer readable storagemedium of claim 16, wherein the updating the HMVP table based on thedetermined motion vector further comprises: in accordance with adetermination that none of the plurality of plurality of motion vectorpredictors in the HMVP table is identical to the determined motionvector: removing an earliest motion vector predictor from the HMVP tablewhen the HMVP table is full; and adding the determined motion vector asa newest one to the HMVP table.
 18. The non-transitory computer readablestorage medium of claim 16, wherein the constructing the motion vectorcandidate list further comprises: adding zero or more motion vectorpredictors from spatially neighboring CUs and/or temporally collocatedCUs of the current CU to the motion vector candidate list; and when acurrent length of the motion vector candidate list is less than a firstpredefined threshold, adding zero or more history-based motion vectorpredictors from the HMVP table to the motion vector candidate list untilthe current length of the motion vector candidate list is equal to thefirst predefined threshold.
 19. The non-transitory computer readablestorage medium of claim 18, wherein the constructing the motion vectorcandidate list further comprises: when the current length of the motionvector candidate list is less than the first predefined threshold,adding zero or more zero-valued motion vector predictors to the motionvector candidate list until the current length of the motion vectorcandidate list is equal to the first predefined threshold.
 20. Thenon-transitory computer readable storage medium of claim 18, wherein theadding zero or more motion vector predictors from spatially neighboringCUs and/or temporally collocated CUs of the current CU to the motionvector candidate list comprises: adding zero or more motion vectorpredictors from the spatially neighboring CUs of the current CU to themotion vector candidate list; and when the current length of the motionvector candidate list is less than the first predefined threshold,adding zero or more motion vector predictors from the temporallycollocated CUs of the current CU to the motion vector candidate list.